Improved Use of Continuous Attributes in C4.5
نویسندگان
چکیده
منابع مشابه
Improved Use of Continuous Attributes in C4.5
A reported weakness of C in domains with continuous attributes is addressed by modifying the formation and evaluation of tests on continuous attributes An MDL inspired penalty is applied to such tests eliminating some of them from consideration and altering the relative desirability of all tests Empirical trials show that the modi cations lead to smaller decision trees with higher predictive ac...
متن کاملImproved Use of Continuous Attributes in C 4
A reported weakness of C4.5 in domains with continuous attributes is addressed by modifying the formation and evaluation of tests on continuous attributes. An MDL-inspired penalty is applied to such tests, eliminating some of them from consideration and altering the relative desirability of all tests. Empirical trials show that the modiications lead to smaller decision trees with higher predict...
متن کاملAttributes for Improved Attributes
We introduce a method for improving facial attribute predictions using other attributes. In the domain of face recognition and verification, attributes are high-level descriptions of face images. Attributes are very useful for identification as well as image search as they provide easily understandable descriptions of faces, rather than most other image descriptors (i.e. HOG, LBP, and SIFT). A ...
متن کاملDiscretization of Continuous Attributes
In the data-mining field, many learning methods — such as association rules, Bayesian networks, and induction rules (Grzymala-Busse & Stefanowski, 2001) — can handle only discrete attributes. Therefore, before the machine-learning process, it is necessary to re-encode each continuous attribute in a discrete attribute constituted by a set of intervals. For example, the age attribute can be trans...
متن کاملDynamic Discretization of Continuous Attributes
Discretization of continuous attributes is an important task for certain types of machine learning algorithms. Bayesian approaches, for instance, require assumptions about data distributions. Decision Trees, on the other hand, require sorting operations to deal with continuous attributes , which largely increase learning times. This paper presents a new method of discretization, whose main char...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 1996
ISSN: 1076-9757
DOI: 10.1613/jair.279